Initial seed selection for K-modes clustering – A distance and density based approach
نویسندگان
چکیده
منابع مشابه
DenClust: A Density Based Seed Selection Approach for K-Means
In this paper we present a clustering technique called DenClust that produces high quality initial seeds through a deterministic process without requiring an user input on the number of clusters k and the radius of the clusters r. The high quality seeds are given input to K-Means as the set of initial seeds to produce the final clusters. DenClust uses a density based approach for initial seed s...
متن کاملA Variant of K-Means Clustering through Heuristic Initial Seed Selection for Improved Clustering of Data
Unsupervised clustering algorithms have been used in many applications to group the data based on relevant similarity metrics. K-Means clustering is one of the most widely used clustering techniques owing to its simplicity. Many improvements and extensions have been proposed for this algorithm in view to improve its performance. Out of the various dimensions that have been explored in this rega...
متن کاملK Modes Clustering Algorithm Based on a New Distance Measure
T he leading par tit ional clustering technique, K Modes, is one of the most computationally eff icient clustering methods fo r categ orical data. In the t raditional K Modes algo rithm, the simple matching dissim ilarity measure is used to compute the distance betw een two values of the same catego rical at t ributes. T his compares tw o categorical v alues directly and results in either a dif...
متن کاملSelection Initial modes for Belief K-modes Method
The belief K-modes method (BKM) approach is a new clustering technique handling uncertainty in the attribute values of objects in both the cluster construction task and the classification one. Like the standard version of this method, the BKM results depend on the chosen initial modes. So, one selection method of initial modes is developed, in this paper, aiming at improving the performances of...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Computer and Information Sciences
سال: 2018
ISSN: 1319-1578
DOI: 10.1016/j.jksuci.2018.04.013